On Hamilton cycle decompositions ofr-uniformr-partite hypergraphs
نویسندگان
چکیده
منابع مشابه
Hamilton cycle decompositions of k-uniform k-partite hypergraphs
Let m ≥ 2 and k ≥ 2 be integers. We show that K k×m has a decomposition into Hamilton cycles of Kierstead-Katona type if k | m. We also show that K (3) 3×m − T has a decomposition into Hamilton cycles where T is a 1-factor if and only if 3 m and m = 4. We introduce a notion of symmetry and comment on the existence of symmetric Hamilton cycle decompositions of K (k) k×m.
متن کاملHamilton decompositions of complete 3-uniform hypergraphs
A k−uniform hypergraphH is a pair (V, ε), where V = {v1, v2, . . . , vn} is a set of n vertices and ε is a family of k-subset of V called hyperedges. A cycle of length l of H is a sequence of the form (v1, e1, v2, e2, . . . , vl, el, v1), where v1, v2, . . . , vl are distinct vertices, and e1, e2, . . . , el are k-edges of H and vi, vi+1 ∈ ei, 1 ≤ i ≤ l, where addition on the subscripts is modu...
متن کاملSymmetric Hamilton cycle decompositions of complete multigraphs
Let n ≥ 3 and λ ≥ 1 be integers. Let λKn denote the complete multigraph with edge-multiplicity λ. In this paper, we show that there exists a symmetric Hamilton cycle decomposition of λK2m for all even λ ≥ 2 and m ≥ 2. Also we show that there exists a symmetric Hamilton cycle decomposition of λK2m − F for all odd λ ≥ 3 and m ≥ 2. In fact, our results together with the earlier results (by Walecki...
متن کاملDecompositions of complete uniform hypergraphs into Hamilton Berge cycles
In 1973 Bermond, Germa, Heydemann and Sotteau conjectured that if n divides ( n k ) , then the complete k-uniform hypergraph on n vertices has a decomposition into Hamilton Berge cycles. Here a Berge cycle consists of an alternating sequence v1, e1, v2, . . . , vn, en of distinct vertices vi and distinct edges ei so that each ei contains vi and vi+1. So the divisibility condition is clearly nec...
متن کاملOn decompositions of complete hypergraphs
We study the minimum number of complete r-partite r-uniform hypergraphs needed to partition the edges of the complete r-uniform hypergraph on n vertices and we improve previous results of Alon.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2014
ISSN: 0012-365X
DOI: 10.1016/j.disc.2013.09.011